InjectiveFunctionKleeneStar inRegexDefineDomainWeakEquivalenceEquivalenceof NFA andDFADifferencebetweensetsCreate aregularexpressionfor cat & catsIndexationin a treeConcatenationin RegexDefineDFADepth-firstsearchSurjectiveFunctionStringDistanceUnioninRegexDefinecodomainBijectiveFunctionBreadth-firstsearchDescribeLemmatizationCardinalityTerminalsin a treeLevenshteinDistanceNon-terminalsin a treeDefineNFARelationsvs.FunctionsInjectiveFunctionKleeneStar inRegexDefineDomainWeakEquivalenceEquivalenceof NFA andDFADifferencebetweensetsCreate aregularexpressionfor cat & catsIndexationin a treeConcatenationin RegexDefineDFADepth-firstsearchSurjectiveFunctionStringDistanceUnioninRegexDefinecodomainBijectiveFunctionBreadth-firstsearchDescribeLemmatizationCardinalityTerminalsin a treeLevenshteinDistanceNon-terminalsin a treeDefineNFARelationsvs.Functions

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