Indexationin a treeEquivalenceof NFA andDFADepth-firstsearchDifferencebetweensetsBreadth-firstsearchInjectiveFunctionDescribeLemmatizationWeakEquivalenceTerminalsin a treeUnioninRegexDefineDomainRelationsvs.FunctionsDefineNFACardinalityLevenshteinDistanceDefinecodomainKleeneStar inRegexConcatenationin RegexNon-terminalsin a treeSurjectiveFunctionBijectiveFunctionCreate aregularexpressionfor cat & catsDefineDFAStringDistanceIndexationin a treeEquivalenceof NFA andDFADepth-firstsearchDifferencebetweensetsBreadth-firstsearchInjectiveFunctionDescribeLemmatizationWeakEquivalenceTerminalsin a treeUnioninRegexDefineDomainRelationsvs.FunctionsDefineNFACardinalityLevenshteinDistanceDefinecodomainKleeneStar inRegexConcatenationin RegexNon-terminalsin a treeSurjectiveFunctionBijectiveFunctionCreate aregularexpressionfor cat & catsDefineDFAStringDistance

Computational Linguistics Bingo - Call List

(Print) Use this randomly generated list as your call list when playing the game. There is no need to say the BINGO column name. Place some kind of mark (like an X, a checkmark, a dot, tally mark, etc) on each cell as you announce it, to keep track. You can also cut out each item, place them in a bag and pull words from the bag.


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
  1. Indexation in a tree
  2. Equivalence of NFA and DFA
  3. Depth-first search
  4. Difference between sets
  5. Breadth-first search
  6. Injective Function
  7. Describe Lemmatization
  8. Weak Equivalence
  9. Terminals in a tree
  10. Union in Regex
  11. Define Domain
  12. Relations vs. Functions
  13. Define NFA
  14. Cardinality
  15. Levenshtein Distance
  16. Define codomain
  17. Kleene Star in Regex
  18. Concatenation in Regex
  19. Non-terminals in a tree
  20. Surjective Function
  21. Bijective Function
  22. Create a regular expression for cat & cats
  23. Define DFA
  24. String Distance