Path: csiph.com!xmission!news.snarked.org!border2.nntp.dca1.giganews.com!nntp.giganews.com!news.misty.com!news.iecc.com!.POSTED.news.iecc.com!nerds-end From: "Derek M. Jones" Newsgroups: comp.compilers Subject: Re: Spell checking identifiers Date: Wed, 24 Jun 2020 11:02:21 +0100 Organization: virginmedia.com Lines: 14 Sender: news@iecc.com Approved: comp.compilers@iecc.com Message-ID: <20-06-013@comp.compilers> References: <20-06-010@comp.compilers> Mime-Version: 1.0 Content-Type: text/plain; charset=utf-8; format=flowed Content-Transfer-Encoding: 8bit Injection-Info: gal.iecc.com; posting-host="news.iecc.com:2001:470:1f07:1126:0:676f:7373:6970"; logging-data="40483"; mail-complaints-to="abuse@iecc.com" Keywords: lex, errors Posted-Date: 24 Jun 2020 14:45:42 EDT X-submission-address: compilers@iecc.com X-moderator-address: compilers-request@iecc.com X-FAQ-and-archives: http://compilers.iecc.com Content-Language: en-US Xref: csiph.com comp.compilers:2534 Johann, > So, without going through the source of rustc to find out, I'm curious > about what general techniques people use to make this work?  In particu- > lar the Damerau–Levenshtein distance algorithm is not appropriate for > dictionary lookups, as far as I know. More than you probably wanted to know: http://www.coding-guidelines.com/cbook/sent792.pdf -- Derek M. Jones blog:shape-of-code.coding-guidelines.com