mahaalkh Goto Github PK

ar-lsat

Experiment for lsat

autoencoding_vi_for_topic_models

Tensorflow implementation for prodLDA and NVLDA.

big-bench

Beyond the Imitation Game collaborative benchmark for measuring and extrapolating the capabilities of language models

calculus3_notes

has my cheat sheet for calculus 3 final and practice exams

ccg2lambda

Provide Semantic Parsing solutions and Natural Language Inferences for multiple languages following the idea of the syntax-semantics interface.

ccgtools

Tools for all things related to Combinatory Categorial Grammar

coursera_deeplearningspecialization

cs3700_notes

has my notes for the topics in networks and distributed systems

cs4100_artificial_intelligence

contains AI hw ranging from search to reinforcement learning algorithms

cs611_algorithms

my cheat sheets for exams

cs6120_natural_language_processing

Includes implementations in OpenFST and in python for NLP techniques

cs6140_machinelearning

contains implementations from linear regression to SVM and neural networks

cs6220_datamining

da-rnn

Dual-Stage Attention-Based Recurrent Neural Net for Time Series Prediction

dativebase

DativeBase = Dative + Online Linguistic Database

depccg

A* CCG Parser with a Supertag and Dependency Factored Model

evolution

A simplified version of the evolution game

examples

A set of examples around pytorch in Vision, Text, Reinforcement Learning, etc.

faust

Python Stream Processing

foma

Automatically exported from code.google.com/p/foma

llama-chat

A boilerplate for creating a Llama 2 chat app

nlp_estimator_tutorial

Educational material on using the TensorFlow Estimator framework for text classification

old-parser-research

Scripts for doing morphological parser-based research via an OLD web service

openccg

OpenCCG library for parsing and realization with CCG

pyccg

A Python library for distantly supervised CCG parsing/learning, based off of NLTK's CCG implementation

scikit-learn

scikit-learn: machine learning in Python

the-most-beautiful-path

a twist of Dijkstra's algorithm to compute the most beautiful path instead of the shortest path