DFA
Define
Match headwords exactly
Match the first word within headwords
Match the last word within headwords
Match headwords within Levenshtein distance one
Match prefixes (skip, count)
Match prefixes
POSIX 1003.2 (modern) regular expressions
Old (basic) regular expressions
Match using SOUNDEX algorithm
Match substring occurring anywhere in a headword
Match suffixes
Match separate words within headwords
from
The Free On-line Dictionary of Computing (8 July 2008)
DFA Deterministic Finite-state Automaton. See {
Finite State Machine
}.
antiflux
/
dictionary
/ DFA
[email protected]