Neighbors Levenshtein all, count
Description:
The number of orthographic neighbors according to the definition of Levenshtein (1966).
According to this definition, an orthographic neighbor differs from its reference type by exactly one change operation, where a change operation is one of inserting, deleting or exchanging one character. It is also said that the edit distance between the two types is 1.
Example: Fliege has higher frequency Levenshtein neighbors liege, Flieger und Fliegen, and less frequent Levenshtein neighbors fliege, Flieg, Fliegt, Fliese and more.
Data type:
- Lexicon frequency
- Absolute value, normalized value, absolute value log10, normalized value log10, rank, rank 123
- per million types (= lexicon entries)
- greater or equal, lower or equal
- -1
Available in tables:
Also, in the ngrams tables, you can use this filter on any of the components:Contents
Current version
- 0.3
- New tables: all measures in case-insensitive variant.