Changeable words: Difference between revisions

{{trans|Go}}

 

 

F hamming_dist(word1, word2)

count += 2

 

 

{{out}}

 

=={{header|Ada}}==

with Ada.Strings.Fixed;

with Ada.Containers.Indefinite_Vectors;

end loop;

end loop;

{{out}}

<pre>

=={{header|Arturo}}==

 

 

wordset: select wordset 'word -> 12 =< size word

 

loop unique results 'result ->

 

{{out}}

 

=={{header|AutoHotkey}}==

oWord := [], Found := []

for i, word in StrSplit(db, "`n", "`r")

num++

return (StrLen(s1) - num = 1)

{{out}}

<pre>aristotelean <-> aristotelian

 

=={{header|AWK}}==

# syntax: GAWK -f CHANGEABLE_WORDS.AWK unixdict.txt

#

exit(0)

}

{{out}}

<pre>

=={{header|C}}==

{{trans|Go}}

#include <stdlib.h>

#include <string.h>

free(dictionary);

return EXIT_SUCCESS;

 

{{out}}

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

{{trans|Go}}

#include <fstream>

#include <iomanip>

}

return EXIT_SUCCESS;

 

{{out}}

 

=={{header|F_Sharp|F#}}==

// Changeable words: Nigel Galloway. June 14th., 2021

let fN g=Seq.fold2(fun z n g->z+if n=g then 0 else 1) 0 g

seq{use n=System.IO.File.OpenText("unixdict.txt") in while not n.EndOfStream do yield n.ReadLine()}|>Seq.filter(fun n->n.Length>11)

|>List.ofSeq|>List.groupBy(fun n->n.Length)|>Seq.collect(fun(_,n)->fG [] n)|>Seq.iter(fun(n,g)->printfn "%s <=> %s" n g)

{{out}}

<pre>

=={{header|Factor}}==

{{works with|Factor|0.99 2021-02-05}}

io.encodings.ascii io.files kernel math math.combinatorics

math.distances sequences ;

[ length 11 > ] filter

2 [ first2 changeable? ] filter-combinations

{{out}}

<pre>

=={{header|FreeBASIC}}==

Brute force method, reuses some code from [[Odd_words#FreeBASIC]].

#define NULL 0

 

next i

curr = curr->nxt

{{out}}

<pre>

=={{header|Go}}==

{{trans|Wren}}

 

import (

}

}

 

{{out}}

 

=={{header|J}}==

aristotelean aristotelian

claustrophobia claustrophobic

spectroscope spectroscopy

underclassman underclassmen

 

=={{header|Java}}==

{{trans|Go}}

import java.util.*;

 

return count;

}

 

{{out}}

{{works with|jq}}

'''Works with gojq, the Go implementation of jq'''

def changeable_to($dict):

. as $w

| . as $w

| [changeable_to($dict)] | unique[]

Invocation: jq -n -rR -f changeable-words.jq unixdict.txt

{{out}}

=={{header|Julia}}==

See [[Alternade_words#Julia]] for the foreachword function.

function ischangeable(w, d)

alternatives = [w[1:p[1]-1] * p[2] * w[p[1]+1:end] for p in Iterators.product(1:length(w), 'a':'z')]

 

foreachword("unixdict.txt", ischangeable, minlen = 12, colwidth=40, numcols=2)

<pre>

Word source: unixdict.txt

=={{header|Nim}}==

Using the standard module <code>std/editdistance</code> to get the distance between two words.

 

# Build list of words with length >= 12.

inc count, 2

 

 

{{out}}

 

=={{header|Perl}}==

 

use strict;

}

push @{ $words[length] }, $_;

{{out}}

<pre>

 

=={{header|Perl}}==

 

use strict; # https://rosettacode.org/wiki/Changeable_words

my $count = 0;

printf "%3d: %15s <-> %s\n", ++$count, $1, $4

{{out}}

<pre>

 

=={{header|Phix}}==

<span style="color: #008080;">with</span> <span style="color: #008080;">javascript_semantics</span>

<span style="color: #008080;">function</span> <span style="color: #000000;">changeable</span><span style="color: #0000FF;">(</span><span style="color: #004080;">string</span> <span style="color: #000000;">a</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">b</span><span style="color: #0000FF;">)</span>

<span style="color: #008080;">end</span> <span style="color: #008080;">for</span>

<span style="color: #7060A8;">printf</span><span style="color: #0000FF;">(</span><span style="color: #000000;">1</span><span style="color: #0000FF;">,</span><span style="color: #008000;">"%d changeable words found:\n%s\n"</span><span style="color: #0000FF;">,{</span><span style="color: #7060A8;">length</span><span style="color: #0000FF;">(</span><span style="color: #000000;">res</span><span style="color: #0000FF;">),</span><span style="color: #7060A8;">join</span><span style="color: #0000FF;">(</span><span style="color: #7060A8;">shorten</span><span style="color: #0000FF;">(</span><span style="color: #000000;">res</span><span style="color: #0000FF;">,</span><span style="color: #008000;">""</span><span style="color: #0000FF;">,</span><span style="color: #000000;">3</span><span style="color: #0000FF;">),</span><span style="color: #008000;">"\n"</span><span style="color: #0000FF;">)})</span>

{{out}}

<pre>

{{works with|SWI Prolog}}

{{trans|Go}}

 

main:-

Count1 is Count + 1,

Count1 < 2,

 

{{out}}

=={{header|Python}}==

 

 

 

print(f"\n{len(cwords)} words that are from changing a char from other words:")

for v in sorted(cwords):

 

{{out}}

 

Get the best of both worlds by doing an initial filter with Sorensen, then get exact results with Levenshtein.

use Text::Sorensen :sorensen;

 

%skip{$_}++ for @sorensens[@levenshtein];

": {$this.fmt('%14s')} <-> ", @sorensens[@levenshtein].join: ', ';

{{out}}

<pre> 1: aristotelean <-> aristotelian

 

It also allows the minimum length to be specified on the command line (CL) as well as the dictionary file identifier.

parse arg minL iFID . /*obtain optional arguments from the CL*/

if minL=='' | minL=="," then minL= 12 /*Not specified? Then use the default.*/

#= # - 1 /*adjust word count because of DO loop.*/

say copies('─', 30) # "words ("n 'usable words) in the dictionary file: ' iFID

{{out|output|text=&nbsp; when using the default inputs:}}

<pre>

 

=={{header|Ring}}==

cStr = read("unixdict.txt")

wordList = str2list(cStr)

 

see "done..." + nl

Output:

<pre>

 

=={{header|Ruby}}==

 

size_groups = words.group_by(&:size).sort.map(&:last)

puts "Found #{res.size} changeable word pairs:"

res.each{|w1, w2|puts "#{w1} - #{w2}" }

{{out}}

<pre>Found 26 changeable word pairs:

=={{header|Sidef}}==

{{trans|Perl}}

 

if (!file.exists) {

}

bucket{len} << word

{{out}}

<pre>

{{libheader|Wren-fmt}}

Using the Hamming Distance between two equal length strings which needs to be 1 here:

import "/fmt" for Fmt

 

}

}

 

{{out}}

 

=={{header|XPL0}}==

int Dict(26000); \pointers to words (enough for unixdict.txt)

int DictSize; \actual number of pointers in Dict

DI:= DI+1;

until DI >= DictSize;

 

{{out}}