DefineNFAStringDistanceBreadth-firstsearchBijectiveFunctionCreate aregularexpressionfor cat & catsLevenshteinDistanceDefineDomainKleeneStar inRegexDifferencebetweensetsDefineDFANon-terminalsin a treeDescribeLemmatizationSurjectiveFunctionConcatenationin RegexEquivalenceof NFA andDFADepth-firstsearchInjectiveFunctionDefinecodomainIndexationin a treeWeakEquivalenceRelationsvs.FunctionsCardinalityUnioninRegexTerminalsin a treeDefineNFAStringDistanceBreadth-firstsearchBijectiveFunctionCreate aregularexpressionfor cat & catsLevenshteinDistanceDefineDomainKleeneStar inRegexDifferencebetweensetsDefineDFANon-terminalsin a treeDescribeLemmatizationSurjectiveFunctionConcatenationin RegexEquivalenceof NFA andDFADepth-firstsearchInjectiveFunctionDefinecodomainIndexationin a treeWeakEquivalenceRelationsvs.FunctionsCardinalityUnioninRegexTerminalsin a tree

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