-
Typical Background: An academic researcher from a social science faculty with a large corpus of texts in their respective field (e.g., legal studies, sociology, history, etc.).
-
Wants: to explore their texts and find suggestions for recurring patterns in it. This is an interactive process, once they find some pattern in the data, they start to form a quantiative question about the data that they want to answer. Typically interested in good coverage -- would like to extract all
Gabriel Stanovsky gabrielStanovsky
gabrielStanovsky
/ kendall_tau_strict.py
Last active
September 18, 2024 06:48
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| def is_concordant_strict(pair, ls1, ls2): | |
| """ | |
| Given a pair of indices, check if ls1 and ls2 agree | |
| on their ranking, if either is a tie, return False. | |
| """ | |
| i1, i2 = pair | |
| return ( (ls1[i1] > ls1[i2]) and (ls2[i1] > ls2[i2])) or \ | |
| ( (ls1[i1] < ls1[i2]) and (ls2[i1] < ls2[i2])) or \ | |
| ( (ls1[i1] == ls1[i2]) and (ls2[i1] == ls2[i2])) |
gabrielStanovsky
/ Spike user personas.md
Last active
May 17, 2023 06:27
gabrielStanovsky
/ git_tutorial.md
Last active
November 30, 2021 13:54
— forked from saifun/git_tutorial.md
Git basics for SLAB
Git is an awesome tool 😄
Table of Contents generated with DocToc