# 52 bits
@staticmethod
def _compute_word_fingerprint(
- word: str,
- population: Mapping[str, int]
+ word: str, population: Mapping[str, int]
) -> int:
fp = 0
- for pair in sorted(population.items(), key=lambda x: x[1], reverse=True):
+ for pair in sorted(
+ population.items(), key=lambda x: x[1], reverse=True
+ ):
letter = pair[0]
if letter in fprint_feature_bit:
count = pair[1]
# 32 bits
@staticmethod
def _compute_word_letter_sig(
- letter_sigs: Mapping[str, int],
- word: str,
- population: Mapping[str, int],
+ letter_sigs: Mapping[str, int],
+ word: str,
+ population: Mapping[str, int],
) -> int:
sig = 0
- for pair in sorted(population.items(), key=lambda x: x[1], reverse=True):
+ for pair in sorted(
+ population.items(), key=lambda x: x[1], reverse=True
+ ):
letter = pair[0]
if letter not in letter_sigs:
continue
"""
population = list_utils.population_counts(word)
fprint = Unscrambler._compute_word_fingerprint(word, population)
- letter_sig = Unscrambler._compute_word_letter_sig(letter_sigs, word, population)
+ letter_sig = Unscrambler._compute_word_letter_sig(
+ letter_sigs, word, population
+ )
assert fprint & letter_sig == 0
sig = fprint | letter_sig
return sig
print(f'0x{sig:x}+{word}', file=f)
def lookup(
- self,
- word: str,
- *,
- include_fuzzy_matches: bool = False
+ self, word: str, *, include_fuzzy_matches: bool = False
) -> Dict[str, bool]:
"""Looks up a potentially scrambled word optionally including near
"fuzzy" matches.
"""
sig = Unscrambler.compute_word_sig(word)
- return self.lookup_by_sig(sig, include_fuzzy_matches=include_fuzzy_matches)
+ return self.lookup_by_sig(
+ sig, include_fuzzy_matches=include_fuzzy_matches
+ )
def lookup_by_sig(
- self,
- sig: int,
- *,
- include_fuzzy_matches:bool = False
+ self, sig: int, *, include_fuzzy_matches: bool = False
) -> Dict[str, bool]:
"""Looks up a word that has already been translated into a signature by
a previous call to Unscrambler.compute_word_sig. Optionally returns