Find solution
How do you store a dictionary on Parse using swift?

How can I implement an English dictionary?

  • I am a computer science sophomore and during my vacations want to implement an English dictionary in c++/python. I will store the data(word - meaning) in a text file.i read about Trie data structure and plan on using it. EDIT: I also found about ternary search tree and think it's cooler. Now should I load all my data in memory and store in a trie/ternary tree or there is other way to do it ?Also if possible please tell me where can i get a dictionary in text format and how to parse it?

  • Answer:

    Generally, using http://en.wikipedia.org/wiki/Ternary_search_tries is considered a fast way to search in a collection of strings, but, remember this will load all data on the memory. Some implementations can avoid this by starting search after the third or second letter and store the current node and it's descendants only. This way, however, will require lots of reconstructions and will decrease the search speed. http://en.wikipedia.org/wiki/Radix_tree and http://en.wikipedia.org/wiki/Hash_tree_(persistent_data_structure) are more space optimized but with lower speed. What I recommend is using JSON or XML and use a built-in function or class for XML documents. The standard implementations are, sometimes, better than you can achieve. Like the implementation of sort() in the String Collection Class in http://referencesource.microsoft.com/. I've read it and it's Most Significant Radix Sort. It's somehow complex but fast and space efficient in the same time. Another way is storing the TST or Radix Tries in the XML document, even though, in "http://www.amazon.com/Algorithm-Design-Manual-Steve-Skiena/dp/0387948600" textbook, it's not recommended to use the Hard Desk as a buffer for slowness, but, it's now an ancient book.

Khaled Kee at Quora Visit the source

Was this solution helpful to you?

Other answers

the dictionary is not stored in a database. it's stored in a text file or gunzip file. Free english dictionary files can be downloaded from this URL: http://www.dicts.info/dictionaries.php. The easiest free dictionary file will be in the format of: word1 explanation for word1 word2 explanation for word2 There are some other formats as well. but all are stored in either text file or text.gz file. http://www.python-course.eu/dictionaries.php

Pratik Lahiri

Hi, it's a great project to start with. So let us get down to how you would go implementing it. If you intend to you Python or any HLL, they have a data structure like Dictionaries, Hash Maps built into it. These DS maps a key to a value and that is what you want. Now, these DS are internally implemented as TRIES, which makes it easier to find the key. The implementation used would be standard, efficient and also fast. So it would make more sense to use these DS rather than implementing your own. Next is loading the text file that contains the words. As you mentioned, you will use a text file which will store a word and its meaning in each line. In order to have both in the same line you would have to use a delimiter so that your program can differentiate between word and meaning. So each of your line could be something like this: WORD##MEANING, where ## is a delimiter. All you have to do is, read the file, parse it into KEY->VALUE pairs for each line, store it in the above mentioned DS. Now when the user searches for a word, all you have to do is find the value corresponding to that key. NOTE: You can use a JSON file to store the word as a key value pair itself. All you need is a Json parser, for which you can use a json library

Shivam Shah

You have several options: A hash table - optimal when you just want to check if the word exists or not in your dictionary. trie - for fast lookups and checking for a given prefix. Directed Acyclic Word Graphs Ternary Search trees or radix trees - will save you space. Succint trie https://en.wikipedia.org/wiki/BK-tree

Aarti Dwivedi

I remember an old Symbian software MobiDictionary...they use a .dic file for their dictionary database in plaintext... If you can get hold of that...you are good to go. BUT DO CHECK COPYRIGHT RESTRICTIONS

Abhishek Sarkar

Related Q & A:

Just Added Q & A:

Find solution

For every problem there is a solution! Proved by Solucija.

  • Got an issue and looking for advice?

  • Ask Solucija to search every corner of the Web for help.

  • Get workable solutions and helpful tips in a moment.

Just ask Solucija about an issue you face and immediately get a list of ready solutions, answers and tips from other Internet users. We always provide the most suitable and complete answer to your question at the top, along with a few good alternatives below.