Path: csiph.com!xmission!news.snarked.org!border2.nntp.dca1.giganews.com!nntp.giganews.com!news.iecc.com!.POSTED.news.iecc.com!nerds-end
From: gautier_niouzes@hotmail.com
Newsgroups: comp.compilers
Subject: Re: Spell checking identifiers
Date: Wed, 24 Jun 2020 13:08:39 -0700 (PDT)
Organization: Compilers Central
Lines: 21
Sender: news@iecc.com
Approved: comp.compilers@iecc.com
Message-ID: <20-06-016@comp.compilers>
References: <20-06-010@comp.compilers>
Mime-Version: 1.0
Content-Type: text/plain; charset="UTF-8"
Content-Transfer-Encoding: 8bit
Injection-Info: gal.iecc.com; posting-host="news.iecc.com:2001:470:1f07:1126:0:676f:7373:6970"; logging-data="8443"; mail-complaints-to="abuse@iecc.com"
Keywords: Ada, lex, errors
Posted-Date: 24 Jun 2020 17:25:47 EDT
X-submission-address: compilers@iecc.com
X-moderator-address: compilers-request@iecc.com
X-FAQ-and-archives: http://compilers.iecc.com
In-Reply-To: <20-06-010@comp.compilers>
Xref: csiph.com comp.compilers:2537

On Tuesday, June 23, 2020 at 8:40:38 PM UTC+2, Johann 'Myrkraverk' Oskarsson

> 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.

GCC's GNAT front-end for Ada does such checks (search for "GNAT.Spelling_Checker").
The source code (at least versions I've found on the Web) does not refer to a
specific algorithm.

A few examples of detection:

hac-parser-expressions.adb:129:35: "Symst" is undefined
hac-parser-expressions.adb:129:35: possible misspelling of "Symset"

hac-parser-expressions.adb:129:35: "Sym_set" is undefined
hac-parser-expressions.adb:129:35: possible misspelling of "Symset"

hac-parser-expressions.adb:129:35: "Sysmet" is undefined
hac-parser-expressions.adb:129:35: possible misspelling of "Symset"