Learning about Directed Acyclic Word Graphs (DAWGs) by implementing them in Rust for dictionary word retrieval and search. For search, I am traversing the graph and calculating the Levenshtein distance from the search term.
Learning about Directed Acyclic Word Graphs (DAWGs) by implementing them in Rust for dictionary word retrieval and search. For search, I am traversing the graph and calculating the Levenshtein distance from the search term.