NYSIIS: Difference between revisions

{{draft task|text processing}}

{{wikipedia}}

 

 

 

;See also

* [[Soundex]]

<br><br>

 

=={{header|C++}}==

Implementation based on Wikipedia description of the algorithm.

 

#include <iostream> // required for debug code in main() only

#include <iomanip> // required for debug code in main() only

}

 

{{out|Example output}}

<pre>

Refactored code based on other examples to reduce footprint.

 

Class Utils.Phonetic [ Abstract ]

{

 

}

{{out|Examples}}

<pre>

=={{header|D}}==

{{trans|Python}}

 

string replaceAt(in string text, in uint pos, in string[] fromList,

foreach (immutable name; names)

writefln("%11s: %s", name, name.nysiis);

{{out}}

<pre> Bishop: BASAP

=={{header|Go}}==

{{trans|Kotlin}}

 

import (

fmt.Printf("%-16s : %s\n", name, name2)

}

 

{{out}}

=={{header|Java}}==

{{works with|Java|8}}

import static java.lang.System.out;

 

return Vowels.indexOf(c) != -1;

}

 

<pre>Carr -> CAR

{{trans|Python}}

 

for (f, t) in zip(fromlist, tolist)

if startswith(text[position:end], f)

"knight", "mitchell", "o'daniel"]

@printf("%15s: %s\n", name, nysiis(name))

 

{{out}}

 

=={{header|Kotlin}}==

 

val fStrs = listOf("MAC" to "MCC", "KN" to "N", "K" to "C", "PH" to "FF",

println("${name.padEnd(16)} : $name2")

}

 

{{out}}

de la Mare II : DALANA(R)

</pre>

 

=={{header|Perl}}==

{{trans|Raku}}

my($name) = @_;

$name =~ s/\h([JS]R)|([IVX]+)$//i;

printf "%10s, %s\n", $_, $nysiis;

}

{{out}}

<pre style="height:35ex"> knight, NAGT

=={{header|Phix}}==

{{trans|Go}}

Note: After some careful consideration, I have decided that all three (see note) tests <i>are</i> in fact correct, or at least follow wp, specifically step 6 <i>before</i> step 7.

{{out}}

=={{header|Python}}==

A literal translation of the algorithm from the [[wp:New York State Identification and Intelligence System|Wikipedia article]].

 

_vowels = 'AEIOU'

'knight', 'mitchell', "o'daniel"]

for name in names:

{{out}}

<pre> Bishop: BASAP

verbose.

 

(require racket/string racket/match)

(define (str-rplc-at str replacement start (end (string-length str)))

 

(for ((n names) (p py-nysiis-names))

 

=={{header|Raku}}==

This implementation removes common name suffixes similar to the reference implementation, even though it is not specified in the task description or on the linked [[wp:New York State Identification and Intelligence System|NYSIIS]] page. This algorithm isn't too friendly to certain French kings. :)

 

$name.uc.subst: /\h (<[JS]>R) | (<[IVX]>+) $/, '';

}

}

printf "%10s, %s\n", $_, $nysiis;

 

Output:

If the rule of only returning (up to) six characters is to be enforced, then the last REXX statement should be

replaced with:

 

do i=1 for words(z) /*process each name (word) in the list.*/

say right(xx, 35) ' ──► ' nysiis(xx) /*display some stuff to the terminal. */

end /*i*/

/*──────────────────────────────────────────────────────────────────────────────────────*/

vowel: return pos(arg(1), 'AEIOUaeiou') \== 0 /*returns 1 if the argument has a vowel*/

/*──────────────────────────────────────────────────────────────────────────────────────*/

 

end /*j*/

/* [↓] elide: */

<pre>

Bishop ──► BASAP

 

=={{header|Tcl}}==

# Normalize to first word, uppercased, without non-letters

set name [regsub -all {[^A-Z]+} [string toupper [regexp -inline {\S+} $name]] ""]

}

return $name

Demonstrating:

knight mitchell "o'daniel" "brown sr" "browne III"

"browne IV" "O'Banion" Mclaughlin McCormack Chapman

} {

puts "$name -> [nysiis $name]"

{{out}}

<pre>

Wheeler -> WHALAR

Louis XVI -> L

</pre>

 

=={{header|zkl}}==

{{trans|Python}}

foreach f,t in (fromList.zip(toList)){

if(0==text[pos,*].find(f)) return(text.set(pos,f.len(),t));

}

replaceEnd(key, T("S", "AY", "A"), T("", "Y", ""));

"Franklin", "Greene", "Harper", "Jacobs", "Larson", "Lawrence",

"Lawson", "Louis, XVI", "Lynch", "Mackenzie", "Matthews",

"knight", "mitchell", "o'daniel");

{{out}}

<pre>