Re: Your dictionaries online!
| From: | Benct Philip Jonsson <bpj@...> |
|---|
| Date: | Wednesday, January 7, 2009, 15:26 |
|---|
taliesin the storyteller wrote:
> * Henrik Theiling said on 2009-01-07 01:58:59 +0100
>> Sounds great! When you presented this the last time, I wondered how
>> strongly inflecting languages (like Þrjótrunn) would be handled. Are
>> there only base form look-ups? (I admit I haven't fully read the
>> RFC).
>
> What is served is a file of entries and an index is used to look up the
> position in the file of entries. If you have an entry for every
> inflected form, you'll be able to search for every inflected form.
> There's no magic on the back end!
>
> As for the actual lookup, there are so called lookup "strategies":
> exact, prefix, substring, regular expression, soundex, levenshtein etc.
> How easy it easy to use a specific strategy to search varies with
> clients.
I looked at this a bit last time it was up and if
I understood correctly (which may well not be the case)
the 'dictionary' is essentially a key--value hash.
Is there any means to peep into the values when searching?
(Even though that'd be slow of course!)
As it happens I've got several tsv dictionary files which
could easily be converted to a key--value format, but would
it be reasonably easy to populate a DICT‑dictionary from
such a file, withouot any retyping of actual entries?
BTW how does levenshtein work? (The for dummies version,
please! ;-)
Replies